Parameterized Local Reduction of Decision Systems
نویسندگان
چکیده
منابع مشابه
Parameterized Local Reduction of Decision Systems
One important and valuable topic in rough sets is attribute reduction of a decision system. The existing attribute reductions are designed to just keep confidence of every certain rule as they cannot identify key conditional attributes explicitly for special decision rules. In this paper, we develop the concept of θ-local reduction in order to offer a minimal description for special θpossible d...
متن کاملInterpolatory Model Reduction of Parameterized Bilinear Dynamical Systems
Interpolatory projection methods for model reduction of nonparametric linear dynamical systems have been successfully extended to nonparametric bilinear dynamical systems. However, this is not the case for parametric bilinear systems. In this work, we aim to close this gap by providing a natural extension of interpolatory projections to model reduction of parametric bilinear dynamical systems. ...
متن کاملGramian-based model order reduction of parameterized time-delay systems
Time-delay systems (TDSs) frequently arise in circuit simulation especially in high-frequency applications. Model order reduction (MOR) techniques can be used to facilitate the simulation of TDSs. On the other hand, many kinds of variations, such as temperature and geometric uncertainties, can have significant impact on the transient responses of TDSs. Therefore, it is important to preserve par...
متن کاملParameterized Model Order Reduction for Nonlinear Dynamical Systems
The presence of several nonlinear analog circuits and Micro-Electro-Mechanical (MEM) components in modern mixed signal System-on-Chips (SoC) makes the fully automatic synthesis and optimization of such systems an extremely challenging task. The research presented in this thesis concerns the development of techniques for generating Parameterized Reduced Order Models (PROMs) of nonlinear dynamica...
متن کاملParameterized Local Lexing
Building on the concept of local lexing the concept of parameterized local lexing is introduced. 1. Motivation We previously introduced local lexing as a new semantics for integrated lexing and parsing, and provided an algorithm (based on Earley’s Algorithm) for it [1]. This algorithm can handle arbitrary context-free grammars. In principle it can even deal with infinite grammars, but to harnes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2012
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2012/857590